Cutset Enumerating and Network Reliability Computing by a new Recursive Algorithm and Inclusion Exclusion Principle
نویسندگان
چکیده
Chang, Y. -R. , Lin, H. -Y. , Chen, I. -Y. & Kuo, S. -Y. , A Cut-Based Algorithm for Reliability Analysis of Terminal-Pair Network Using OBDD, Proceedings of the 27th Annual International Conference on Computer Software and Applications, 2003. Fard, N. S. & Lee, T. -H. , Cutset enumeration of network systems with link and node failures, Reliability Engineering and System Safety 1999, pp. 141 146. JGraphT, http://jgrapht. org/ Khachiyan, L. , Boros, E. , Elbassioni, K. , Gurvich, V. & Makino, K. , Enumerating disjunctions and conjunctions of paths and cuts in reliability theory, Discrete Appl. Math 2007, pp. 137-149. Lin, H. -Y. , Kuo, S. -Y. & Yeh, F. -M. , Minimal Cutset Enumeration and Network
منابع مشابه
Inclusion-Exclusion and Network Reliability
Based on a recent improvement of the inclusion-exclusion principle, we present a new approach to network reliability problems. In particular, we give a new proof of a result of Shier, which expresses the reliability of a network as an alternating sum over chains in a semilattice, and a new proof of a result of Provan and Ball, which provides an algorithm for computing network reliability in pse...
متن کاملAn Anytime Boosting Scheme for Bounding Posterior Beliefs
This paper presents an any-time scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power is in that it can use any available scheme that bounds the probability of evidence, enhance its performance in an anytime manner, and transform it effectively into bounds for posterior marginals. The scheme is novel in that using the cuts...
متن کاملStructural Reliability: An Assessment Using a New and Efficient Two-Phase Method Based on Artificial Neural Network and a Harmony Search Algorithm
In this research, a two-phase algorithm based on the artificial neural network (ANN) and a harmony search (HS) algorithm has been developed with the aim of assessing the reliability of structures with implicit limit state functions. The proposed method involves the generation of datasets to be used specifically for training by Finite Element analysis, to establish an ANN model using a proven AN...
متن کاملRecursive Contraction Algorithm: a Novel and Efficient Graph Traversal Method for Scanning All Minimal Cut Sets
We propose a novel algorithm called RCA_MC, in which we use the breadth first search method (BFS) in conjunction with edge contraction and connectivity properties of a given undirected graph to enumerate and scan all its minimal edge cutsets. It is known that the problem of enumerating all minimal edge cutsets of a given graph is #P-complete. In addition, we introduce the concepts of pivot vert...
متن کاملCutset sampling for Bayesian networks Cutset sampling for Bayesian networks
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network structure-exploiting application of the Rao-Blackwellisation principle to sampling in Bayesian networks. It improves convergence by exploiting memory-based inference algorithms. It can also be viewed as an anytime appro...
متن کامل